Identifying influential spreaders in complex networks

نویسندگان

  • Maksim Kitsak
  • Lazaros K. Gallos
  • Shlomo Havlin
  • Fredrik Liljeros
  • Lev Muchnik
  • H. Eugene Stanley
  • Hernán A. Makse
چکیده

Maksim Kitsak, 2 Lazaros K. Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H. Eugene Stanley, and Hernán A. Makse Center for Polymer Studies and Physics Department, Boston University, Boston, Massachusetts 02215, USA Cooperative Association for Internet Data Analysis (CAIDA), University of California-San Diego, La Jolla, California 92093, USA Levich Institute and Physics Department, City College of New York, New York, New York 10031, USA Minerva Center and Department of Physics, Bar-Ilan University, Ramat Gan, Israel Department of Sociology, Stockholm University, S-10691, Stockholm, Sweden Information Operations and Management Sciences Department, Stern School of Business, New York University, New York, New York 10012, USA (Dated: October 5, 2011)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Community-Based Approach to Identifying Influential Spreaders

Identifying influential spreaders in complex networks has a significant impact on understanding and control of spreading process in networks. In this paper, we introduce a new centrality index to identify influential spreaders in a network based on the community structure of the network. The community-based centrality (CbC) considers both the number and sizes of communities that are directly li...

متن کامل

Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition

Identifying the most influential spreaders is an important issue in understanding and controlling spreading processes on complex networks. Recent studies showed that nodes located in the core of a network as identified by the k-shell decomposition are the most influential spreaders. However, through a great deal of numerical simulations, we observe that not in all real networks do nodes in high...

متن کامل

Corrigendum: Identifying a set of influential spreaders in complex networks

Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-r ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and k-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also propose...

متن کامل

Identifying influential spreaders in complex networks based on gravity formula

How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value of each node as its mass and the shortest path distance between two nodes as their distance, then inspired by the idea of the gravity formula, we propose a gr...

متن کامل

Finding influential spreaders from human activity beyond network location

Most centralities proposed for identifying influential spreaders on social networks to either spread a message or to stop an epidemic require the full topological information of the network on which spreading occurs. In practice, however, collecting all connections between agents in social networks can be hardly achieved. As a result, such metrics could be difficult to apply to real social netw...

متن کامل

Weighted H-index for identifying influential spreaders

Spreading is a ubiquitous process in the social, biological and technological systems. Therefore, identifying influential spreaders, which is important to prevent epidemic spreading and to establish effective vaccination strategies, is full of theoretical and practical significance. In this paper, a weighted h-index centrality based on virtual nodes extension is proposed to quantify the spreadi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011